Integrating Formal Verification with Mur ? of Distributed Cache Coherence Protocols in FAME Multiprocessor System Design
نویسنده
چکیده
Flexible Architecture for Multiple Environments (FAME) is Bull architecture for large symmetrical multiprocessors based on Intel’s Itanium® 2 family, which is used in Bull NovaScale® servers series. A key point in the development of this distributed shared memory architecture is the definition of its cache coherence protocol. This paper reports experiences and results of integrating formal verification of FAME cache coherence protocol, on 4 successive versions of this architecture. The goal is to find protocol definition bugs (not implementation) in the early phases of the design, focusing on: cache coherency, data integrity and deadlock-freeness properties. We have performed modeling and verification using Murφ tool and language, because of its easiness of use and its efficient state reduction techniques. The analysis of the results shows that this approach is cost-effective, and in spite of the state explosion problem, it has helped us in finding hard-to-simulate protocol bugs, before the implementation is far ahead.
منابع مشابه
Real Value for Minimal Cost: Formal Verification of a Distributed Shared Memory Cache Coherence Protocol (A Case Study)
A case study of the formal verification of a cache coherence protocol for a distributed shared memory multi-processor system is presented. A subtle coherence bug was found after 5 person weeks of effort. The process of overcoming size problems is discussed in detail. This project has shown that real value for minimal cost can be achieved using the current state of the art of symbolic model chec...
متن کاملFormal Verification of the HAL S1 System Cache Coherence Protocol
This paper describes our experience applying formal verification to the cache coherence protocol of the HAL S1 System, a shared-memory and/or message-passing multiprocessor consisting of standard Intel Pentium R Pro symmetric multiprocessing (SMP) servers connected by HAL’s proprietary Mercury Interconnect to create a cache-coherent, non-uniform memory access (CC-NUMA) machine. In recent years,...
متن کاملFormal Verification of Delayed Consistency Protocols
In a cache-coherent, shared-memory multiprocessor system, data consistency among cached copies can be delayed until synchronization points under relaxed memory consistency models. Some protocols called delayed consistency protocols take advantage of this flexibility to reduce cache miss rates and memory traffic. However, they are very complex and validating their correctness, even at the behavi...
متن کاملExperience with a Language for Writing Coherence Protocols
In this paper we describe our experience with Teapot [7], a domain-specific language for addressing the cache coherence problem. The cache coherence problem arises when parallel and distributed computing systems make local replicas of shared data for reasons of scalability and performance. In both distributed shared memory systems and distributed file systems, a coherence protocol maintains agr...
متن کاملHeuristics for Complexity-Effective Verification of a Cache Coherence Protocol Implementation
Verifying the correctness of a shared-memory multiprocessor cache coherence protocol, and its implementation in silicon, is an extraordinarily complex and time-consuming task. The detailed formal verification model developed for the Cray X1 cache coherence protocol, for instance, produces a search space with over 214 million reachable states. Exhaustively searching this space for errors in the ...
متن کامل